Selecting a dynamic and stochastic path method for vehicle routing and scheduling problems
نویسندگان
چکیده
منابع مشابه
STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملstochastic vehicle routing problems with simultaneous pickup and delivery services
the problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. the purpose of this paper is to develop a vehicle routing problem (vrp) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملA dynamic scheme for stochastic vehicle routing
This paper considers stochastic load-constrained vehicle routing systems in which a fleet of homogeneous vehicles is dispatched from a central depot to serve the demands of surrounding customers. Customer locations and load sizes are known only in distribution before operations. Variants of this problem are often treated with very simple uncoordinated operating schemes, which are mathematically...
متن کاملA mathematical model for vehicle routing and scheduling problem with cross-docking by considering risk
Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2010
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2010.04.017